Evaluating bound-constrained minimization software

نویسندگان

  • Ernesto G. Birgin
  • Jan M. Gentil
چکیده

Bound-constrained minimization is a subject of active research. To assess the performance of existent solvers, numerical evaluations and comparisons are carried on. Arbitrary decisions that may have a crucial effect on the conclusions of numerical experiments are highlighted in the present work. As a result, an evaluation framework based on performance profiles is developed and applied to the comparison of bound-constrained minimization solvers. Extensive numerical results are presented and analyzed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems

BOUND-CONSTRAINED MINIMIZATION PROBLEMS MARY ANN BRANCH , THOMAS F. COLEMAN AND YUYING LI Abstract. A subspace adaptation of the Coleman-Li trust region and interior method is proposed for solving large-scale bound-constrained minimization problems. This method can be implemented with either sparse Cholesky factorization or conjugate gradient computation. Under reasonable conditions the converg...

متن کامل

Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization

A practical active-set method for bound-constrained minimization is introduced. Within the current face the classical Euclidian trust-region method is employed. Spectral projected gradient directions are used to abandon faces. Numerical results are presented.

متن کامل

Constrained Discrete Optimization via Dual Space Search

This paper proposes a novel algorithm for solving NP-hard constrained discrete minimization problems whose unconstrained versions are solvable in polynomial time such as constrained submodular function minimization. Applications of our algorithm include constrained MAP inference in Markov Random Fields, and energy minimization in various computer vision problems. Our algorithm assumes the exist...

متن کامل

An Optimal Approach for Minimization of Total Costs in the Multi-mode Resource-constrained Project Scheduling Problem

In this paper, we introduce a new multimode project scheduling problem, taking into account finish-to-start precedence relations among project activities as well as renewable and nonrenewable resources constraints. We suppose renewable resources are hired and not accessible in all time intervals of a project. In other words, there is a presumed release date as well as a mandated due date for ea...

متن کامل

Symbolic-Interval Heuristic for Bound-Constrained Minimization

Global optimization subject to bound constraints helps answer many practical questions in chemistry, molecular biology, economics. Most of algorithms for solution of global optimization problems are a combination of interval methods and exhuastive search. The efficiency of such algorithms is characterized by their ability to detect and eliminate sub-optimal feasible regions. This ability is inc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comp. Opt. and Appl.

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2012